Considering the fact that uncertain parameters were widespread in the Traveling Salesman Problem (TSP), this paper built a robust optimization model for traveling salesman problem under the frame of Bertsimas robust discrete optimization theory, and then transformed it into robust counterpart model according to transformational rule. In addition, a single parent genetic algorithm based on Prufer coding was designed to solve the traveling salesman problem. Compared with the traditional genetic algorithm, the method has shortened the length of the chromosome and prevented feasible solutions being destructed by the traditional crossover and mutation operators. According to the validation by numerical examples, the results show that the algorithm has a higher solving efficiency, and the robust model developed in the uncertain environment can get some better robust solutions.